Comments on "Albayrak, M., & Allahverdy N. (2011). Development a new mutation operator to solve the Traveling Salesman Problem by aid of genetic algorithms. Expert Systems with Applications, 38(3), 1313-1320": A proposal of good practice

نویسندگان

  • Eneko Osaba
  • Enrique Onieva
  • Fernando Díaz
  • Roberto Carballedo
  • Asier Perallos
چکیده

This short note presents a discussion arisen after reading ”Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms”, by Murat Albayrak and Novruz Allahverdi, (2011). Expert System with Applications (38)(pp. 1313-1320). The discussed paper presents a new greedy mutation operator to solve the well-known Traveling Salesman Problem. To prove the quality of their new operator, the authors compare different versions of a classical genetic algorithm, each of one with a different mutation operator. The experimentation shown by the authors can generate some controversy. In this short note, we explain the origin of this controversy and we bring a solution to prevent it in future publications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over

Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...

متن کامل

Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm

The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

متن کامل

AN EFFICIENT CROSSOVER OPERATOR FOR TRAVELING SALESMAN PROBLEM

Crossover operator plays a crucial role in the efficiency of genetic algorithm (GA). Several crossover operators have been proposed for solving the travelling salesman problem (TSP) in the literature. These operators have paid less attention to the characteristics of the traveling salesman problem, and majority of these operators can only generate feasible solutions. In this paper, a crossover ...

متن کامل

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

متن کامل

Solving the Ride-Sharing Problem with Non-Homogeneous Vehicles by Using an Improved Genetic Algorithm with Innovative Mutation Operators and Local Search Methods

An increase in the number of vehicles in cities leads to several problems, including air pollution, noise pollution, and congestion. To overcome these problems, we need to use new urban management methods, such as using intelligent transportation systems like ride-sharing systems. The purpose of this study is to create and implement an improved genetic algorithms model for ride-sharing with non...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Expert Syst. Appl.

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2014